1 8 N ov 1 99 8 Isoperimetric Functions of Groups and Computational Complexity of the Word Problem
نویسنده
چکیده
We prove that the word problem of a finitely generated group G is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group H with polynomial isoperimetric function. The embedding can be chosen in such a way that G has bounded distortion in H. This completes the work started in [26] and [24].
منابع مشابه
Isoperimetric inequalities and the homology of groups
An isoperimetric function for a finitely presented group G bounds the number of defining relations needed to prove that a word w =G 1 in terms of the length of w. Suppose G = F/R is a finitely presented group where F is a finitely generated free group and R is the normal closure of a finite set of relators. For each w ∈ R we define the area ∆(w) to be the least number of uses of the given relat...
متن کاملFunctions on Groups and Computational Complexity
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linear...
متن کاملSocial choice, computational complexity, Gaussian geometry, and Boolean functions
We describe a web of connections between the following topics: the mathematical theory of voting and social choice; the computational complexity of the Maximum Cut problem; the Gaussian Isoperimetric Inequality and Borell’s generalization thereof; the Hypercontractive Inequality of Bonami; and, the analysis of Boolean functions. A major theme is the technique of reducing inequalities about Gaus...
متن کاملar X iv : m at h / 06 08 15 5 v 2 [ m at h . G R ] 1 7 Se p 20 08 Snowflake groups , Perron – Frobenius eigenvalues , and isoperimetric spectra
The k–dimensional Dehn (or isoperimetric) function of a group bounds the volume of efficient ball-fillings of k–spheres mapped into k–connected spaces on which the group acts properly and cocompactly; the bound is given as a function of the volume of the sphere. We advance significantly the observed range of behavior for such functions. First, to each non-negative integer matrix P and positive ...
متن کامل1 8 N ov 1 99 8 The Density Matrix Renormalization Group , Quantum Groups and Conformal Field Theory
We present an overview of the Density Matrix Renormalization Group and its connections to Quantum Groups, Matrix Products and Conformal Field Theory. We emphasize some common formal structures in all these theories. We also propose two-dimensional extensions of the variational matrix product ansatzs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008